Complete Geometric Query Languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Geometric Query Languages

We extend Chandra and Harel s seminal work on computable queries for re lational databases to a setting in which also spatial data may be present using a constraint based data model Concretely we introduce both coordinate based and point based query languages that are complete in the sense that they can express precisely all computable queries that are generic with respect to certain classes of...

متن کامل

Trajectory Databases: Data Models, Uncertainty and Complete Query Languages

Moving objects produce trajectories. We describe a data model for trajectories and trajectory samples and an efficient way of modeling uncertainty via beads for trajectory samples. We study transformations of the ambient space for which important physical properties of trajectories, such as speed, are invariant. We also determine which transformations preserve beads. We give conceptually easy f...

متن کامل

On BP-complete query languages on K-relations

The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RA+K, similar to the classical positive relational algebra, allows for the querying of K-relations. We study the completeness of RA+K in the sense of Bancilhon and Paredaens (BP) and show that RA+K is, in general, not BP-complete. Fac...

متن کامل

Concept Languages as Query Languages

We study concept languages (also called terminological languages) as means for both defining a knowledge base and expressing queries. In particular, we investigate on the possibility of using two different concept languages, one for asserting facts about individual objects, and the other for querying a set of such assertions. Contrary to many negative results on the complexity of terminological...

متن کامل

Naturally Embedded Query Languages

We investigate the properties of a simple programming language whose main computational engine is structural recursion on sets. We describe a progression of sublanguages in this paradigm that (1) have increasing expressive power, and (2) illustrate robust conceptual restrictions thus exhibiting interesting additional properties. These properties suggest that we consider our sublanguages as cand...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1999

ISSN: 0022-0000

DOI: 10.1006/jcss.1999.1630